package bloomberg;

public class PrimeNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		long result = 1;

        for(int i=0; i<2000000; i++) {
            if(isPrime(i)) {
                result+= i;
            }
        }
        System.out.println(result);
	}
	
	private static boolean isPrime(long n) {
	    boolean result = false;

	    for(long i=2; i<(long)Math.sqrt(n); i++) {
	        if(n%i == 0) {
	            result = false;
	            break;
	        }
	        else result = true;
	    }
	    return result;
	}
	
}
